A DNA Sticker Algorithm for Parallel Reduction over Finite Field
نویسندگان
چکیده
This paper proposes a DNA sticker algorithm for parallel reduction over finite field GF(2 n ). This algorithm is suitable for some specific finite fields defined with trinomials or pentanomials. We use one binary finite field GF(2 163 ) which is recommended by National Institute of Standards and Technology (NIST) to describe the details about our algorithm. The solution space of 2 325 cases could be figured out within 3059 DNA steps. This work also presents clear evidence of ability of DNA computing to perform complicated mathematic operations for elliptic curve cryptosystem over finite field GF(2 n ).
منابع مشابه
A Parallel Algorithm for Solving Sat Problem Based on Dna Computing
In this paper, stickers are used to construct a solution space of DNA for the satisfiability (SAT) problem. Simultaneously DNA operations are applied in the sticker-based model to develop a DNA algorithm. The result of the proposed algorithm shows that the SAT problem is resolved with biological operation in the sticker-based model for solution space of sticker. Furthermore, this work presents ...
متن کاملSolving the 0/1 Knapsack Problem by a Biomolecular DNA Computer
Solving some mathematical problems such as NP-complete problems by conventional silicon-based computers is problematic and takes so long time. DNA computing is an alternative method of computing which uses DNA molecules for computing purposes. DNA computers have massive degrees of parallel processing capability. The massive parallel processing characteristic of DNA computers is of particular in...
متن کاملSpeeding up the Stress Analysis of Hollow Circular FGM Cylinders by Parallel Finite Element Method
In this article, a parallel computer program is implemented, based on Finite Element Method, to speed up the analysis of hollow circular cylinders, made from Functionally Graded Materials (FGMs). FGMs are inhomogeneous materials, which their composition gradually varies over volume. In parallel processing, an algorithm is first divided to independent tasks, which may use individual or shared da...
متن کاملA DNA Sticker Algorithm for Solving N-Queen Problem
Over the past few decades numerous attempts have been made to solve combinatorial optimization problems that are NP-complete or NP -hard. It has been evidenced that DNA computing can solve those problems which are currently intractable on even fastest electronic computers. This paper proposes a new DNA algorithm for solving N-Queen problem, a complex optimization problem. The algorithm not only...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کامل